Secure elastic storage in a dispersed storage network

ABSTRACT

A method for execution by a dispersed storage and task (DST) processing unit includes: generating an encoded data slice from a dispersed storage encoding of a data object and determining when the encoded data slice will not be stored in local dispersed storage. When the encoded data slice will not be stored in the local dispersed storage, the encoded data slice is stored via at least one elastic slice in an elastic dispersed storage, cryptographic material and an elastic storage pointer indicating a location of the elastic slice in the elastic dispersed storage are generated, and the cryptographic material and the elastic storage pointer are stored in the local dispersed storage.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not applicable.

BACKGROUND OF THE INVENTION Technical Field of the Invention

This invention relates generally to computer networks and moreparticularly to dispersing error encoded data.

Description of Related Art

Computing devices are known to communicate data, process data, and/orstore data. Such computing devices range from wireless smart phones,laptops, tablets, personal computers (PC), work stations, and video gamedevices, to data centers that support millions of web searches, stocktrades, or on-line purchases every day. In general, a computing deviceincludes a central processing unit (CPU), a memory system, userinput/output interfaces, peripheral device interfaces, and aninterconnecting bus structure.

As is further known, a computer may effectively extend its CPU by using“cloud computing” to perform one or more computing functions (e.g., aservice, an application, an algorithm, an arithmetic logic function,etc.) on behalf of the computer. Further, for large services,applications, and/or functions, cloud computing may be performed bymultiple cloud computing resources in a distributed manner to improvethe response time for completion of the service, application, and/orfunction. For example, Hadoop is an open source software framework thatsupports distributed applications enabling application execution bythousands of computers.

In addition to cloud computing, a computer may use “cloud storage” aspart of its memory system. As is known, cloud storage enables a user,via its computer, to store files, applications, etc. on an Internetstorage system. The Internet storage system may include a RAID(redundant array of independent disks) system and/or a dispersed storagesystem that uses an error correction scheme to encode data for storage.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a dispersed ordistributed storage network (DSN) in accordance with the presentinvention;

FIG. 2 is a schematic block diagram of an embodiment of a computing corein accordance with the present invention;

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data in accordance with the present invention;

FIG. 4 is a schematic block diagram of a generic example of an errorencoding function in accordance with the present invention;

FIG. 5 is a schematic block diagram of a specific example of an errorencoding function in accordance with the present invention;

FIG. 6 is a schematic block diagram of an example of a slice name of anencoded data slice (EDS) in accordance with the present invention;

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of data in accordance with the present invention;

FIG. 8 is a schematic block diagram of a generic example of an errordecoding function in accordance with the present invention;

FIG. 9A is a schematic block diagram of an embodiment of a dispersed ordistributed storage network (DSN) in accordance with the presentinvention;

FIG. 9B is a schematic block diagram of an embodiment of a dispersed ordistributed storage network (DSN) in accordance with the presentinvention; and

FIG. 10 is a logic diagram of an example of a method of elastic storagein accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of an embodiment of a dispersed, ordistributed, storage network (DSN) 10 that includes a plurality ofcomputing devices 12-16, a managing unit 18, an integrity processingunit 20, and a DSN memory 22. The components of the DSN 10 are coupledto a network 24, which may include one or more wireless and/or wirelined communication systems; one or more non-public intranet systemsand/or public interne systems; and/or one or more local area networks(LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of storage units 36 that may belocated at geographically different sites (e.g., one in Chicago, one inMilwaukee, etc.), at a common site, or a combination thereof. Forexample, if the DSN memory 22 includes eight storage units 36, eachstorage unit is located at a different site. As another example, if theDSN memory 22 includes eight storage units 36, all eight storage unitsare located at the same site. As yet another example, if the DSN memory22 includes eight storage units 36, a first pair of storage units are ata first common site, a second pair of storage units are at a secondcommon site, a third pair of storage units are at a third common site,and a fourth pair of storage units are at a fourth common site. Notethat a DSN memory 22 may include more or less than eight storage units36. Further note that each storage unit 36 includes a computing core (asshown in FIG. 2, or components thereof) and a plurality of memorydevices for storing dispersed error encoded data.

In various embodiments, each of the storage units operates as adistributed storage and task (DST) execution unit, and is operable tostore dispersed error encoded data and/or to execute, in a distributedmanner, one or more tasks on data. The tasks may be a simple function(e.g., a mathematical function, a logic function, an identify function,a find function, a search engine function, a replace function, etc.), acomplex function (e.g., compression, human and/or computer languagetranslation, text-to-voice conversion, voice-to-text conversion, etc.),multiple simple and/or complex functions, one or more algorithms, one ormore applications, etc. Hereafter, a storage unit may be interchangeablyreferred to as a DST execution unit and a set of storage units may beinterchangeably referred to as a set of DST execution units.

Each of the computing devices 12-16, the managing unit 18, and theintegrity processing unit 20 include a computing core 26, which includesnetwork interfaces 30-33. Computing devices 12-16 may each be a portablecomputing device and/or a fixed computing device. A portable computingdevice may be a social networking device, a gaming device, a cell phone,a smart phone, a digital assistant, a digital music player, a digitalvideo player, a laptop computer, a handheld computer, a tablet, a videogame controller, and/or any other portable device that includes acomputing core. A fixed computing device may be a computer (PC), acomputer server, a cable set-top box, a satellite receiver, a televisionset, a printer, a fax machine, home entertainment equipment, a videogame console, and/or any type of home or office computing equipment.Note that each of the managing unit 18 and the integrity processing unit20 may be separate computing devices, may be a common computing device,and/or may be integrated into one or more of the computing devices 12-16and/or into one or more of the storage units 36.

Each interface 30, 32, and 33 includes software and hardware to supportone or more communication links via the network 24 indirectly and/ordirectly. For example, interface 30 supports a communication link (e.g.,wired, wireless, direct, via a LAN, via the network 24, etc.) betweencomputing devices 14 and 16. As another example, interface 32 supportscommunication links (e.g., a wired connection, a wireless connection, aLAN connection, and/or any other type of connection to/from the network24) between computing devices 12 & 16 and the DSN memory 22. As yetanother example, interface 33 supports a communication link for each ofthe managing unit 18 and the integrity processing unit 20 to the network24.

Computing devices 12 and 16 include a dispersed storage (DS) clientmodule 34, which enables the computing device to dispersed storage errorencode and decode data as subsequently described with reference to oneor more of FIGS. 3-8. In this example embodiment, computing device 16functions as a dispersed storage processing agent for computing device14. In this role, computing device 16 dispersed storage error encodesand decodes data on behalf of computing device 14. With the use ofdispersed storage error encoding and decoding, the DSN 10 is tolerant ofa significant number of storage unit failures (the number of failures isbased on parameters of the dispersed storage error encoding function)without loss of data and without the need for a redundant or backupcopies of the data. Further, the DSN 10 stores data for an indefiniteperiod of time without data loss and in a secure manner (e.g., thesystem is very resistant to unauthorized attempts at accessing thedata).

In operation, the managing unit 18 performs DS management services. Forexample, the managing unit 18 establishes distributed data storageparameters (e.g., vault creation, distributed storage parameters,security parameters, billing information, user profile information,etc.) for computing devices 12-14 individually or as part of a group ofuser devices. As a specific example, the managing unit 18 coordinatescreation of a vault (e.g., a virtual memory block associated with aportion of an overall namespace of the DSN) within the DSN memory 22 fora user device, a group of devices, or for public access and establishesper vault dispersed storage (DS) error encoding parameters for a vault.The managing unit 18 facilitates storage of DS error encoding parametersfor each vault by updating registry information of the DSN 10, where theregistry information may be stored in the DSN memory 22, a computingdevice 12-16, the managing unit 18, and/or the integrity processing unit20.

The DSN managing unit 18 creates and stores user profile information(e.g., an access control list (ACL)) in local memory and/or withinmemory of the DSN memory 22. The user profile information includesauthentication information, permissions, and/or the security parameters.The security parameters may include encryption/decryption scheme, one ormore encryption keys, key generation scheme, and/or dataencoding/decoding scheme.

The DSN managing unit 18 creates billing information for a particularuser, a user group, a vault access, public vault access, etc. Forinstance, the DSN managing unit 18 tracks the number of times a useraccesses a non-public vault and/or public vaults, which can be used togenerate a per-access billing information. In another instance, the DSNmanaging unit 18 tracks the amount of data stored and/or retrieved by auser device and/or a user group, which can be used to generate aper-data-amount billing information.

As another example, the managing unit 18 performs network operations,network administration, and/or network maintenance. Network operationsincludes authenticating user data allocation requests (e.g., read and/orwrite requests), managing creation of vaults, establishingauthentication credentials for user devices, adding/deleting components(e.g., user devices, storage units, and/or computing devices with a DSclient module 34) to/from the DSN 10, and/or establishing authenticationcredentials for the storage units 36. Network administration includesmonitoring devices and/or units for failures, maintaining vaultinformation, determining device and/or unit activation status,determining device and/or unit loading, and/or determining any othersystem level operation that affects the performance level of the DSN 10.Network maintenance includes facilitating replacing, upgrading,repairing, and/or expanding a device and/or unit of the DSN 10.

The integrity processing unit 20 performs rebuilding of ‘bad’ or missingencoded data slices. At a high level, the integrity processing unit 20performs rebuilding by periodically attempting to retrieve/list encodeddata slices, and/or slice names of the encoded data slices, from the DSNmemory 22. For retrieved encoded slices, they are checked for errors dueto data corruption, outdated version, etc. If a slice includes an error,it is flagged as a ‘bad’ slice. For encoded data slices that were notreceived and/or not listed, they are flagged as missing slices. Badand/or missing slices are subsequently rebuilt using other retrievedencoded data slices that are deemed to be good slices to produce rebuiltslices. The rebuilt slices are stored in the DSN memory 22.

FIG. 2 is a schematic block diagram of an embodiment of a computing core26 that includes a processing module 50, a memory controller 52, mainmemory 54, a video graphics processing unit 55, an input/output (TO)controller 56, a peripheral component interconnect (PCI) interface 58,an IO interface module 60, at least one IO device interface module 62, aread only memory (ROM) basic input output system (BIOS) 64, and one ormore memory interface modules. The one or more memory interfacemodule(s) includes one or more of a universal serial bus (USB) interfacemodule 66, a host bus adapter (HBA) interface module 68, a networkinterface module 70, a flash interface module 72, a hard drive interfacemodule 74, and a DSN interface module 76.

The DSN interface module 76 functions to mimic a conventional operatingsystem (OS) file system interface (e.g., network file system (NFS),flash file system (FFS), disk file system (DFS), file transfer protocol(FTP), web-based distributed authoring and versioning (WebDAV), etc.)and/or a block memory interface (e.g., small computer system interface(SCSI), internet small computer system interface (iSCSI), etc.). The DSNinterface module 76 and/or the network interface module 70 may functionas one or more of the interface 30-33 of FIG. 1. Note that the IO deviceinterface module 62 and/or the memory interface modules 66-76 may becollectively or individually referred to as IO ports.

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data. When a computing device 12 or 16 has data tostore it disperse storage error encodes the data in accordance with adispersed storage error encoding process based on dispersed storageerror encoding parameters. Here, the computing device stores data object40, which can include a file (e.g., text, video, audio, etc.), or otherdata arrangement. The dispersed storage error encoding parametersinclude an encoding function (e.g., information dispersal algorithm,Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematicencoding, on-line codes, etc.), a data segmenting protocol (e.g., datasegment size, fixed, variable, etc.), and per data segment encodingvalues. The per data segment encoding values include a total, or pillarwidth, number (T) of encoded data slices per encoding of a data segmenti.e., in a set of encoded data slices); a decode threshold number (D) ofencoded data slices of a set of encoded data slices that are needed torecover the data segment; a read threshold number (R) of encoded dataslices to indicate a number of encoded data slices per set to be readfrom storage for decoding of the data segment; and/or a write thresholdnumber (W) to indicate a number of encoded data slices per set that mustbe accurately stored before the encoded data segment is deemed to havebeen properly stored. The dispersed storage error encoding parametersmay further include slicing information (e.g., the number of encodeddata slices that will be created for each data segment) and/or slicesecurity information (e.g., per encoded data slice encryption,compression, integrity checksum, etc.).

In the present example, Cauchy Reed-Solomon has been selected as theencoding function (a generic example is shown in FIG. 4 and a specificexample is shown in FIG. 5); the data segmenting protocol is to dividethe data object into fixed sized data segments; and the per data segmentencoding values include: a pillar width of 5, a decode threshold of 3, aread threshold of 4, and a write threshold of 4. In accordance with thedata segmenting protocol, the computing device 12 or 16 divides dataobject 40 into a plurality of fixed sized data segments (e.g., 1 throughY of a fixed size in range of Kilo-bytes to Tera-bytes or more). Thenumber of data segments created is dependent of the size of the data andthe data segmenting protocol.

The computing device 12 or 16 then disperse storage error encodes a datasegment using the selected encoding function (e.g., Cauchy Reed-Solomon)to produce a set of encoded data slices. FIG. 4 illustrates a genericCauchy Reed-Solomon encoding function, which includes an encoding matrix(EM), a data matrix (DM), and a coded matrix (CM). The size of theencoding matrix (EM) is dependent on the pillar width number (T) and thedecode threshold number (D) of selected per data segment encodingvalues. To produce the data matrix (DM), the data segment is dividedinto a plurality of data blocks and the data blocks are arranged into Dnumber of rows with Z data blocks per row. Note that Z is a function ofthe number of data blocks created from the data segment and the decodethreshold number (D). The coded matrix is produced by matrix multiplyingthe data matrix by the encoding matrix.

FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encodingwith a pillar number (T) of five and decode threshold number of three.In this example, a first data segment is divided into twelve data blocks(D1-D12). The coded matrix includes five rows of coded data blocks,where the first row of X11-X14 corresponds to a first encoded data slice(EDS 1_1), the second row of X21-X24 corresponds to a second encodeddata slice (EDS 2_1), the third row of X31-X34 corresponds to a thirdencoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to afourth encoded data slice (EDS 4_1), and the fifth row of X51-X54corresponds to a fifth encoded data slice (EDS 5_1). Note that thesecond number of the EDS designation corresponds to the data segmentnumber.

Returning to the discussion of FIG. 3, the computing device also createsa slice name (SN) for each encoded data slice (EDS) in the set ofencoded data slices. A typical format for a slice name 80 is shown inFIG. 6. As shown, the slice name (SN) 80 includes a pillar number of theencoded data slice (e.g., one of 1-T), a data segment number (e.g., oneof 1-Y), a vault identifier (ID), a data object identifier (ID), and mayfurther include revision level information of the encoded data slices.The slice name functions as, at least part of, a DSN address for theencoded data slice for storage and retrieval from the DSN memory 22.

As a result of encoding, the computing device 12 or 16 produces aplurality of sets of encoded data slices, which are provided with theirrespective slice names to the storage units for storage. As shown, thefirst set of encoded data slices includes EDS 1_1 through EDS 5_1 andthe first set of slice names includes SN 1_1 through SN 5_1 and the lastset of encoded data slices includes EDS 1_Y through EDS 5_Y and the lastset of slice names includes SN 1_Y through SN 5_Y.

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of a data object that was dispersed storage error encodedand stored in the example of FIG. 4. In this example, the computingdevice 12 or 16 retrieves from the storage units at least the decodethreshold number of encoded data slices per data segment. As a specificexample, the computing device retrieves a read threshold number ofencoded data slices.

To recover a data segment from a decode threshold number of encoded dataslices, the computing device uses a decoding function as shown in FIG.8. As shown, the decoding function is essentially an inverse of theencoding function of FIG. 4. The coded matrix includes a decodethreshold number of rows (e.g., three in this example) and the decodingmatrix in an inversion of the encoding matrix that includes thecorresponding rows of the coded matrix. For example, if the coded matrixincludes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2,and 4, and then inverted to produce the decoding matrix.

FIG. 9A is a schematic block diagram of another embodiment of adispersed storage network (DSN) that includes a “Hybrid Cloud” thatcombines local dispersed storage such as mostly fixed resource/harder toscale DSN memory or other fixed or local DSN memory with elasticdispersed storage such as an elastically scalable or practicallyunlimited DSN memory or other elastic DSN memory. This Hybrid Cloudsystem includes a local DSN memory with a computing device 16 of FIG. 1,the network 24 of FIG. 1 and local dispersed storage 900 having aplurality of storage units 1-n. The network 24 is further coupled toelastic dispersed storage 902 that includes a plurality of storage units1′-n′ of an elastic DSN memory. As shown in conjunction with FIG. 9B,the elastic DSN memory may include its own computing device or otherdistributed storage and task (DST) processing unit.

The computing device 16 can include the interface 32 of FIG. 1, thecomputing core 26 of FIG. 1, and the DS client module 34 of FIG. 1. Thecomputing device 16 can function as a dispersed storage processing agentfor computing device 14 as described previously, and may hereafter bereferred to as a distributed storage and task (DST) processing unit.Each storage unit 1-n and 1′-n′ may be implemented utilizing the storageunit 36 of FIG. 1. The DSN functions to facilitate storage of dataslices via the local dispersed storage 900 and/or the elastic dispersedstorage 902.

In various embodiments, a processing system of a dispersed storage andtask (DST) processing unit includes at least one processor and a memorythat stores operational instructions, that when executed by the at leastone processor cause the processing system to generate an encoded dataslice from a dispersed storage encoding of a data object and determinewhen the encoded data slice will not be stored in local dispersedstorage. When the encoded data slice will not be stored in the localdispersed storage, the encoded data slice is stored via at least oneelastic slice in an elastic dispersed storage, cryptographic materialand an elastic storage pointer indicating a location of the elasticslice in the elastic dispersed storage are generated. The cryptographicmaterial and the elastic storage pointer are stored in the localdispersed storage.

In various embodiments, determining when the encoded data slice will notbe stored in local dispersed storage is based on at least one of: anavailable storage capacity of the local dispersed storage, a comparisonof elastic storage cost to local storage cost, a security requirementassociated with the data object, an access parameter associated with thedata object, or a status parameter of the local dispersed storage. Theelastic storage pointer can include a DSN memory identifier associatedwith the elastic dispersed storage, a data object identifier, anamespace location associated with the elastic dispersed storage, aslice name associated with the elastic slice, a slice name associatedwith the encoded data slice, a revision identifier associated with theencoded data slice. A write request response can be received from thelocal dispersed storage in response to the storing of the elasticstorage pointer.

In various embodiments, storing the encoded data slice via the elasticslice can be performed by: storing the encoded data slice as the atleast one elastic slice; dispersed storage encoding the encoded dataslice into a plurality of elastic slices, and storing the plurality ofelastic slices in a plurality of storage units of the elastic dispersedstorage; or sending the encoded data slice to another DST processingunit associated with the elastic dispersed storage for dispersed storageencoding the encoded data slice into a plurality of elastic slices andstorage of the plurality of elastic slices in a plurality of storageunits of the elastic dispersed storage. The operational instructions,when executed by the at least one processor, can further cause theprocessing system to: send a read request to the local dispersed storagefor the encoded data slice; and receive a response to the read requestfrom the local dispersed storage that includes the encoded data slice asrecovered from the elastic dispersed storage.

In various embodiments, the cryptographic material includes at least oneof: a key encryption key; encryption key; hash-message authenticationcode (HMAC) key; digital signing key; or a public/private key pair. Theoperational instructions, when executed by the at least one processor,can further cause the processing system to: send a read request to thelocal dispersed storage for the encoded data slice and retrieve theelastic slice from the elastic dispersed storage and verifying theelastic slice. When the elastic slice is verified, a response to theread request from the local dispersed storage can be generated toinclude the encoded data slice as recovered from the elastic slice. Whenthe elastic slice is not verified, the response to the read request fromthe local dispersed storage can be generated to include a read errorindication.

The operation of the DST processing unit can be further illustrated inconjunction with the following example where the local storage 900 isimplemented via a local on-premises DSN memory and the elastic dispersedstorage 902 is implemented via an elastic DSN memory, such as a DSNcloud storage public utility or service. Often, the local DSN memory isfixed and has a fixed cost, while the elastic DSN may have a marginalcost per usage. A DST processing unit, operating within the local DSNmemory, may decide whether to store a slice it receives locally, or tostore the slice in an elastic DSN memory and store a pointer such as an“elastic storage pointer” in the local DSN memory to where that slicewas stored locally. The DST processing unit may make the decision tostore a slice in the elastic DSN memory in cases such as: when a statusparameter indicates the local DSN memory has degraded, or failed, when aperformance parameter indicates performance of storing slices locally isbeyond the capabilities of the local DSN memory, when the local DSNmemory is out of available storage capacity, has insufficient availablestorage capacity to store the encoded data slice, when it is determinedto be cheaper to store the slice in the elastic DSN memory rather thanwithin the local DSN memory or when a security requirement associatedwith the data object dictates that local storage is required.

When the DST processing unit determines it will store the slice in theelastic DSN memory, it generates the elastic storage pointer, which canbe merely a short descriptor of where within the elastic DSN memory theslice is stored, and how it is stored. For example, it may include a DSNmemory ID, an object ID, a namespace location, a slice name in theelastic DSN memory, or other fields necessary and relevant to therestoration of the slice at a later time. The pointer may contain theoriginal slice name and revision so that listing requests can besatisfied without having to read the slice stored remotely. The localDSN memory then stores the elastic storage pointer in lieu of storingthe slice locally. The encoded data slice is stored in the elastic DSNmemory.

An encoded data slice may be stored in different ways. For example, theencoded data slice destined for storage in the elastic DSN memory as oneor more “elastic slice(s)” can be stored directly as an elastic slicewith a single storage unit 1′-n′ in the elastic DSN memory. In thiscase, the elastic data slice is merely the encoded data slice and thestorage units 1-n in the fixed DSN memory may be paired or linked tocertain other storage units 1′-n′ in the elastic DSN memory, tofacilitate storage and retrieval of the elastic slice.

In another example, presented in greater detail in conjunction with FIG.9B, the encoded data slice can be stored as its own data object bysending it to a DST processing unit in the elastic DSN memory to bedispersed storage encoded and further sub-divided into a write thresholdnumber of elastic slices that are stored in a write threshold number ofthe storage units 1′-n′ in the elastic DSN memory. In a further example,the encoded data slice can be further dispersed storage encoded by theDST processing unit of the local DSN memory itself into a writethreshold number of elastic slices. The resulting elastic slices can besent for storage in a write threshold number of the storage units 1′-n′in the elastic DSN memory.

After the storage of the elastic slice or slices completes, the localDSN memory returns a response to the write request in the same way itwould have returned it had the encoded data slice been stored within thelocal DSN memory itself. Upon a read request for a slice that has beenstored remotely, the local DSN memory determines that an elastic slicepointer, rather than the slice itself, is stored locally. The local DSNmemory then extracts relevant information from the elastic slice pointerto determine its location and how to retrieve it from the elastic DSNmemory. The local DSN memory then recovers the slice from the elasticDSN memory by reversing the particular mechanism for creating theelastic slice or slices defined above. When the encoded data slice isrestored, the local DSN memory returns the slice in response to the readrequest. Since remotely stored slices generally have higher cost tostore and retrieve, as well as worse performance, the local DSN memorymay “pull in” remotely stored slices as capacity and performanceconstraints allow. For example, if space is freed on the local DSNmemory, the local DSN memory may process locally stored elastic slicepointers to recover the corresponding slices and store the recoveredslices locally and remove the elastic slice pointer. In this fashion,future reads for these slices do not require communicating with units inthe elastic DSN memory, and potential elastic DSN memory costs can bereduced.

In various embodiments, the elastic DSN memory, may be less trusted,less secure, more prone to attack, more exposed, and more subject todata interception by adversaries because it is external from the fixedDSN memory and/or not under direct control of the entity that ownsand/or controls the fixed DSN memory. To mitigate these securityconcerns, storage units and/or DST processing units operating within thefixed DSN memory, when choosing to store slices or objects in theelastic DSN memory, can generate cryptographic (crypto) material, suchas: key encryption keys such as wrapping keys; encryption keys;hash-message authentication code (HMAC) keys; digital signing keys;public/private key pairs and/or other crypto material for securing thestorage of elastic slices in the elastic DSN memory.

The cryptographic material can be used to encrypt and/or sign theencoded slice data or the elastic slices, prior to storage in theelastic DSN memory. In addition, the cryptographic material may bestored within the DST processing unit or storage unit, in conjunctionwith the elastic slice pointer. In particular, the crypto material canbe stored separately from the elastic slice pointer on the storage unit,within the elastic slice pointer on the storage unit, or in anothervault or container within the fixed DSN memory. When returning an objector slices from the elastic DSN memory, the storage unit or DSTprocessing unit identifies the corresponding cryptographic materialneeded to verify and decrypt the object/slice, before returning it tothe requester. If the verification fails, the storage unit or DSTprocessing unit may return an error indication, such as a read error orother indication, instead of the requested object or slice.

FIG. 9B is a schematic block diagram of an embodiment of a dispersedstorage network (DSN). In particular, an elastic DSN memory is presentedfor use in conjunction with the DSN Hybrid Cloud system of FIG. 9A. Theelastic DSN memory includes a computing device 16′ of FIG. 1, andelastic dispersed storage 902 having a plurality of storage units 1′-n′.The network 24 is coupled to the elastic DSN memory and the componentsof local DSN memory discussed in conjunction with FIG. 9A. The computingdevice 16′ can include the interface 32 of FIG. 1, the computing core 26of FIG. 1, and the DS client module 34 of FIG. 1. The computing device16′ can function as a dispersed storage processing agent for computingdevice 14 as described previously, and may hereafter be referred to as adistributed storage and task (DST) processing unit. Each storage unit1′-n′ may be implemented utilizing the storage unit 36 of FIG. 1.

As discussed in conjunction with FIG. 9A, an elastic data slice may bestored in different ways. In the example shown, an encoded data slicecan be stored as its own data object by sending it as indicated by“elastic slice” to computing device 16′ that operates as a DSTprocessing unit. The computing device 16′ dispersed storage encodes theelastic slice and further sub-divides the slice into a write thresholdnumber of DS encoded elastic slices that are stored in a write thresholdnumber of the storage units 1′-n′ in the elastic DSN memory.

FIG. 10 is a flowchart illustrating an example of elastic storage in aDSN. In particular, a method is presented for use in conjunction withone or more functions and features described in association with FIGS.1-9A and 9B. For example, the method can be executed by a dispersedstorage and task (DST) processing unit that includes a processor andassociated memory or via another processing system of a dispersedstorage network that includes at least one processor and memory thatstores instruction that configure the processor or processors to performthe steps described below. Step 1002 includes generating an encoded dataslice from a dispersed storage encoding of a data object. In step 1004,the method determines whether or not the encoded data slice will not bestored in local dispersed storage. If the method determines to store theencoded data slice in local dispersed storage, the method proceeds tostep 1006 where such storage takes place. When the encoded data slicewill not be stored in the local dispersed storage, the method proceedsto steps 1008, 1010 and 1012. Step 1008 includes storing the encodeddata slice via at least one elastic slice in an elastic dispersedstorage. Step 1010 includes generating cryptographic material and anelastic storage pointer indicating a location of the elastic slice inthe elastic dispersed storage. Step 1012 includes storing thecryptographic material and the elastic storage pointer in the localdispersed storage.

In various embodiments determining whether or not the encoded data slicewill be stored in local dispersed storage is based on at least one of:an available storage capacity of the local dispersed storage, acomparison of elastic storage cost to local storage cost, a securityrequirement associated with the data object, an access parameterassociated with the data object, or a status parameter of the localdispersed storage. The elastic storage pointer can include: a DSN memoryidentifier associated with the elastic dispersed storage, a data objectidentifier, a namespace location associated with the elastic dispersedstorage, a slice name associated with the elastic slice, a slice nameassociated with the encoded data slice, or a revision identifierassociated with the encoded data slice.

In various embodiments, storing the encoded data slice via the elasticslice can be performed by: storing the encoded data slice as the atleast one elastic slice; dispersed storage encoding the encoded dataslice into a plurality of elastic slices, and storing the plurality ofelastic slices in a plurality of storage units of the elastic dispersedstorage; or sending the encoded data slice to another DST processingunit associated with the elastic dispersed storage for dispersed storageencoding the encoded data slice into a plurality of elastic slices andstorage of the plurality of elastic slices in a plurality of storageunits of the elastic dispersed storage. The method can further includesending a read request to the local dispersed storage for the encodeddata slice; and receiving a response to the read request from the localdispersed storage that includes the encoded data slice as recovered fromthe elastic dispersed storage.

In various embodiments, the cryptographic material includes at least oneof: a key encryption key; encryption key; hash-message authenticationcode (HMAC) key; digital signing key; or a public/private key pair. Themethod can further include: sending a read request to the localdispersed storage for the encoded data slice and retrieving the elasticslice from the elastic dispersed storage and verifying the elasticslice. When the elastic slice is verified, a response to the readrequest from the local dispersed storage can be generated to include theencoded data slice as recovered from the elastic slice. When the elasticslice is not verified, the response to the read request from the localdispersed storage can be generated to includes a read error indication.

In various embodiments, a non-transitory computer readable storagemedium includes at least one memory section that stores operationalinstructions that, when executed by a processing system of a dispersedstorage network (DSN) that includes a processor and a memory, causes theprocessing system to generate an encoded data slice from a dispersedstorage encoding of a data object and determine when the encoded dataslice will not be stored in local dispersed storage. When the encodeddata slice will not be stored in the local dispersed storage, theencoded data slice is stored via at least one elastic slice in anelastic dispersed storage, cryptographic material and an elastic storagepointer indicating a location of the elastic slice in the elasticdispersed storage are generated and the cryptographic material andelastic storage pointer are stored in the local dispersed storage.

It is noted that terminologies as may be used herein such as bit stream,stream, signal sequence, etc. (or their equivalents) have been usedinterchangeably to describe digital information whose contentcorresponds to any of a number of desired types (e.g., data, video,speech, audio, etc. any of which may generally be referred to as‘data’).

As may be used herein, the terms “substantially” and “approximately”provides an industry-accepted tolerance for its corresponding termand/or relativity between items. Such an industry-accepted toleranceranges from less than one percent to fifty percent and corresponds to,but is not limited to, component values, integrated circuit processvariations, temperature variations, rise and fall times, and/or thermalnoise. Such relativity between items ranges from a difference of a fewpercent to magnitude differences. As may also be used herein, theterm(s) “configured to”, “operably coupled to”, “coupled to”, and/or“coupling” includes direct coupling between items and/or indirectcoupling between items via an intervening item (e.g., an item includes,but is not limited to, a component, an element, a circuit, and/or amodule) where, for an example of indirect coupling, the intervening itemdoes not modify the information of a signal but may adjust its currentlevel, voltage level, and/or power level. As may further be used herein,inferred coupling (i.e., where one element is coupled to another elementby inference) includes direct and indirect coupling between two items inthe same manner as “coupled to”. As may even further be used herein, theterm “configured to”, “operable to”, “coupled to”, or “operably coupledto” indicates that an item includes one or more of power connections,input(s), output(s), etc., to perform, when activated, one or more itscorresponding functions and may further include inferred coupling to oneor more other items. As may still further be used herein, the term“associated with”, includes direct and/or indirect coupling of separateitems and/or one item being embedded within another item.

As may be used herein, the term “compares favorably”, indicates that acomparison between two or more items, signals, etc., provides a desiredrelationship. For example, when the desired relationship is that signal1 has a greater magnitude than signal 2, a favorable comparison may beachieved when the magnitude of signal 1 is greater than that of signal 2or when the magnitude of signal 2 is less than that of signal 1. As maybe used herein, the term “compares unfavorably”, indicates that acomparison between two or more items, signals, etc., fails to providethe desired relationship.

As may also be used herein, the terms “processing module”, “processingcircuit”, “processor”, and/or “processing unit” may be a singleprocessing device or a plurality of processing devices. Such aprocessing device may be a microprocessor, micro-controller, digitalsignal processor, microcomputer, central processing unit, fieldprogrammable gate array, programmable logic device, state machine, logiccircuitry, analog circuitry, digital circuitry, and/or any device thatmanipulates signals (analog and/or digital) based on hard coding of thecircuitry and/or operational instructions. The processing module,module, processing circuit, and/or processing unit may be, or furtherinclude, memory and/or an integrated memory element, which may be asingle memory device, a plurality of memory devices, and/or embeddedcircuitry of another processing module, module, processing circuit,and/or processing unit. Such a memory device may be a read-only memory,random access memory, volatile memory, non-volatile memory, staticmemory, dynamic memory, flash memory, cache memory, and/or any devicethat stores digital information. Note that if the processing module,module, processing circuit, and/or processing unit includes more thanone processing device, the processing devices may be centrally located(e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that if the processing module, module, processing circuit,and/or processing unit implements one or more of its functions via astate machine, analog circuitry, digital circuitry, and/or logiccircuitry, the memory and/or memory element storing the correspondingoperational instructions may be embedded within, or external to, thecircuitry comprising the state machine, analog circuitry, digitalcircuitry, and/or logic circuitry. Still further note that, the memoryelement may store, and the processing module, module, processingcircuit, and/or processing unit executes, hard coded and/or operationalinstructions corresponding to at least some of the steps and/orfunctions illustrated in one or more of the Figures. Such a memorydevice or memory element can be included in an article of manufacture.

One or more embodiments have been described above with the aid of methodsteps illustrating the performance of specified functions andrelationships thereof. The boundaries and sequence of these functionalbuilding blocks and method steps have been arbitrarily defined hereinfor convenience of description. Alternate boundaries and sequences canbe defined so long as the specified functions and relationships areappropriately performed. Any such alternate boundaries or sequences arethus within the scope and spirit of the claims. Further, the boundariesof these functional building blocks have been arbitrarily defined forconvenience of description. Alternate boundaries could be defined aslong as the certain significant functions are appropriately performed.Similarly, flow diagram blocks may also have been arbitrarily definedherein to illustrate certain significant functionality.

To the extent used, the flow diagram block boundaries and sequence couldhave been defined otherwise and still perform the certain significantfunctionality. Such alternate definitions of both functional buildingblocks and flow diagram blocks and sequences are thus within the scopeand spirit of the claims. One of average skill in the art will alsorecognize that the functional building blocks, and other illustrativeblocks, modules and components herein, can be implemented as illustratedor by discrete components, application specific integrated circuits,processors executing appropriate software and the like or anycombination thereof.

In addition, a flow diagram may include a “start” and/or “continue”indication. The “start” and “continue” indications reflect that thesteps presented can optionally be incorporated in or otherwise used inconjunction with other routines. In this context, “start” indicates thebeginning of the first step presented and may be preceded by otheractivities not specifically shown. Further, the “continue” indicationreflects that the steps presented may be performed multiple times and/ormay be succeeded by other activities not specifically shown. Further,while a flow diagram indicates a particular ordering of steps, otherorderings are likewise possible provided that the principles ofcausality are maintained.

The one or more embodiments are used herein to illustrate one or moreaspects, one or more features, one or more concepts, and/or one or moreexamples. A physical embodiment of an apparatus, an article ofmanufacture, a machine, and/or of a process may include one or more ofthe aspects, features, concepts, examples, etc. described with referenceto one or more of the embodiments discussed herein. Further, from figureto figure, the embodiments may incorporate the same or similarly namedfunctions, steps, modules, etc. that may use the same or differentreference numbers and, as such, the functions, steps, modules, etc. maybe the same or similar functions, steps, modules, etc. or differentones.

Unless specifically stated to the contra, signals to, from, and/orbetween elements in a figure of any of the figures presented herein maybe analog or digital, continuous time or discrete time, and single-endedor differential. For instance, if a signal path is shown as asingle-ended path, it also represents a differential signal path.Similarly, if a signal path is shown as a differential path, it alsorepresents a single-ended signal path. While one or more particulararchitectures are described herein, other architectures can likewise beimplemented that use one or more data buses not expressly shown, directconnectivity between elements, and/or indirect coupling between otherelements as recognized by one of average skill in the art.

The term “module” is used in the description of one or more of theembodiments. A module implements one or more functions via a device suchas a processor or other processing device or other hardware that mayinclude or operate in association with a memory that stores operationalinstructions. A module may operate independently and/or in conjunctionwith software and/or firmware. As also used herein, a module may containone or more sub-modules, each of which may be one or more modules.

As may further be used herein, a computer readable memory includes oneor more memory elements. A memory element may be a separate memorydevice, multiple memory devices, or a set of memory locations within amemory device. Such a memory device may be a read-only memory, randomaccess memory, volatile memory, non-volatile memory, static memory,dynamic memory, flash memory, cache memory, and/or any device thatstores digital information. The memory device may be in a form a solidstate memory, a hard drive memory, cloud memory, thumb drive, servermemory, computing device memory, and/or other physical medium forstoring digital information.

While particular combinations of various functions and features of theone or more embodiments have been expressly described herein, othercombinations of these features and functions are likewise possible. Thepresent disclosure is not limited by the particular examples disclosedherein and expressly incorporates these other combinations.

What is claimed is:
 1. A method for execution by a dispersed storage andtask (DST) processing unit that includes a processor, the methodcomprises: generating an encoded data slice from a dispersed storageencoding of a data object; determining when the encoded data slice willnot be stored in local dispersed storage; when the encoded data slicewill not be stored in the local dispersed storage: storing the encodeddata slice via at least one elastic slice in an elastic dispersedstorage; generating cryptographic material and an elastic storagepointer indicating a location of the elastic slice in the elasticdispersed storage; and storing the cryptographic material and theelastic storage pointer in the local dispersed storage.
 2. The method ofclaim 1 wherein determining when the encoded data slice will not bestored in local dispersed storage is based on at least one of: anavailable storage capacity of the local dispersed storage, a comparisonof elastic storage cost to local storage cost, a security requirementassociated with the data object, an access parameter associated with thedata object, or a status parameter of the local dispersed storage. 3.The method of claim 1 wherein the elastic storage pointer includes a DSNmemory identifier associated with the elastic dispersed storage, a dataobject identifier, a namespace location associated with the elasticdispersed storage, a slice name associated with the elastic slice, aslice name associated with the encoded data slice, or a revisionidentifier associated with the encoded data slice.
 4. The method ofclaim 1 wherein storing the encoded data slice via the elastic slice isperformed by: storing the encoded data slice as the at least one elasticslice.
 5. The method of claim 1 wherein storing the encoded data slicevia the elastic slice is performed by: dispersed storage encoding theencoded data slice into a plurality of elastic slices; and storing theplurality of elastic slices in a plurality of storage units of theelastic dispersed storage.
 6. The method of claim 1 wherein storing theencoded data slice via the elastic slice is performed by: sending theencoded data slice to another DST processing unit associated with theelastic dispersed storage for dispersed storage encoding the encodeddata slice into a plurality of elastic slices and storage of theplurality of elastic slices in a plurality of storage units of theelastic dispersed storage.
 7. The method of claim 1 wherein thecryptographic material includes at least one of: a key encryption key;encryption key; hash-message authentication code (HMAC) key; digitalsigning key; or a public/private key pair.
 8. The method of claim 1further comprising: sending a read request to the local dispersedstorage for the encoded data slice; retrieving the elastic slice fromthe elastic dispersed storage and verifying the elastic slice; when theelastic slice is verified, generating a response to the read requestfrom the local dispersed storage that includes the encoded data slice asrecovered from the elastic slice; and when the elastic slice is notverified, generating the response to the read request from the localdispersed storage to includes a read error indication.
 9. A processingsystem of a dispersed storage and task (DST) processing unit comprises:at least one processor; a memory that stores operational instructions,that when executed by the at least one processor cause the processingsystem to: generate an encoded data slice from a dispersed storageencoding of a data object; determine when the encoded data slice willnot be stored in local dispersed storage; when the encoded data slicewill not be stored in the local dispersed storage: store the encodeddata slice via at least one elastic slice in an elastic dispersedstorage; generate cryptographic material and an elastic storage pointerindicating a location of the elastic slice in the elastic dispersedstorage; and store the cryptographic material and the elastic storagepointer in the local dispersed storage.
 10. The processing system ofclaim 9 wherein determining when the encoded data slice will not bestored in local dispersed storage is based on at least one of: anavailable storage capacity of the local dispersed storage, a comparisonof elastic storage cost to local storage cost, a security requirementassociated with the data object, an access parameter associated with thedata object, or a status parameter of the local dispersed storage. 11.The processing system of claim 9 wherein the elastic storage pointerincludes a DSN memory identifier associated with the elastic dispersedstorage, a data object identifier, a namespace location associated withthe elastic dispersed storage, a slice name associated with the elasticslice, a slice name associated with the encoded data slice, or arevision identifier associated with the encoded data slice.
 12. Theprocessing system of claim 9 wherein storing the encoded data slice viathe elastic slice is performed by: storing the encoded data slice as theat least one elastic slice.
 13. The processing system of claim 9 whereinstoring the encoded data slice via the elastic slice is performed by:dispersed storage encoding the encoded data slice into a plurality ofelastic slices; and storing the plurality of elastic slices in aplurality of storage units of the elastic dispersed storage.
 14. Theprocessing system of claim 9 wherein storing the encoded data slice viathe elastic slice is performed by: sending the encoded data slice toanother DST processing unit associated with the elastic dispersedstorage for dispersed storage encoding the encoded data slice into aplurality of elastic slices and storage of the plurality of elasticslices in a plurality of storage units of the elastic dispersed storage.15. The processing system of claim 9 wherein a write request response isreceived from the local dispersed storage in response to the storing ofthe elastic storage pointer.
 16. The processing system of claim 9wherein the operational instructions, when executed by the at least oneprocessor, further cause the processing system to: send a read requestto the local dispersed storage for the encoded data slice; retrieve theelastic slice from the elastic dispersed storage and verifying theelastic slice; when the elastic slice is verified, generate a responseto the read request from the local dispersed storage that includes theencoded data slice as recovered from the elastic slice; and when theelastic slice is not verified, generate the response to the read requestfrom the local dispersed storage to include a read error indication. 17.A non-transitory computer readable storage medium comprises: at leastone memory section that stores operational instructions that, whenexecuted by a processing system of a dispersed storage network (DSN)that includes a processor and a memory, causes the processing system to:generate an encoded data slice from a dispersed storage encoding of adata object; determine when the encoded data slice will not be stored inlocal dispersed storage; when the encoded data slice will not be storedin the local dispersed storage: store the encoded data slice via atleast one elastic slice in an elastic dispersed storage; generatecryptographic material and an elastic storage pointer indicating alocation of the elastic slice in the elastic dispersed storage; andstore the cryptographic material and the elastic storage pointer in thelocal dispersed storage.
 18. The non-transitory computer readablestorage medium of claim 17 wherein determining when the encoded dataslice will not be stored in local dispersed storage is based on at leastone of: an available storage capacity of the local dispersed storage, acomparison of elastic storage cost to local storage cost, a securityrequirement associated with the data object, an access parameterassociated with the data object, or a status parameter of the localdispersed storage.
 19. The non-transitory computer readable storagemedium of claim 17 wherein the cryptographic material includes at leastone of: a key encryption key; encryption key; hash-messageauthentication code (HMAC) key; digital signing key; or a public/privatekey pair.
 20. The non-transitory computer readable storage medium ofclaim 17 wherein the operational instructions, when executed by theprocessing system, further cause the processing system to: send a readrequest to the local dispersed storage for the encoded data slice; andretrieve the elastic slice from the elastic dispersed storage andverifying the elastic slice; when the elastic slice is verified,generate a response to the read request from the local dispersed storagethat includes the encoded data slice as recovered from the elasticslice; and when the elastic slice is not verified, generate the responseto the read request from the local dispersed storage to include a readerror indication.